import math
def find(s,num):
ans = ""
k = int(s)
for i in range(num+1):
ans += str(k)
k = abs(k-1)
return ans
for _ in range(int(input())):
zz,zo,oo = map(int,input().split())
if zo==0:
if zz!=0:
print("0"*(zz+1))
if oo!=0:
print("1"*(oo+1))
else:
if zo%2==1:
print("0"*zz+find(0,zo)+"1"*oo)
else:
ans = "1"+zz*"0"+find(0,zo-1)+"1"*oo
print(ans)#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while(t--)
{
int n0, n1, n2;
cin >> n0 >> n1 >> n2;
if(n1 == 0) {
if(n0)
for(int i = 0; i < n0 + 1; i++)
cout << 0;
if(n2)
for(int i = 0; i < n2 + 1; i++)
cout << 1;
}
else{
if(n1 % 2 == 0){
cout << 1;
n1--;
}
for(int i = 0; i < n0; i++)
cout << 0;
for(int i = 0; i < (n1 + 1) / 2; i++)
cout << "01";
for(int i = 0; i < n2; i++)
cout << 1;
}
cout << '\n';
}
return 0;
}
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |